700. 二叉搜索树中的搜索

Similar Question

leading to the advanced question

Solution Tips

方案一: DFS

子树类型

var searchBST = function(root, val) {
    if (root === null) return null;

    if (root.val === val) {
        return root;
    }

    return val < root.val ? searchBST(root.left, val) : searchBST(root.right, val);
};

console.log(searchBST(tree.root, 12))

方案二: 迭代

var searchBST = function(root, val) {
    while (root) {
        if (val === root.val) {
            return root;
        }
        root = val < root.val ? root.left : root.right;
    }
    return null;
};